SherbyNet - /page/wikibook/entry.mu

Micron Document

<!DOCTYPE html>

<title>Slide attack</title>

</head>

<span id="openzim-page-title" class="mw-page-title-main"><span class="mw-page-title-main">Slide attack</span></span>

</h1>

</header>

/* start https://en.wikipedia.org/ */

.mw-parser-output .ambox{border:1px solid #a2a9b1;border-left:10px solid #36c;background-color:#fbfbfb;box-sizing:border-box}.mw-parser-output .ambox+link+.ambox,.mw-parser-output .ambox+link+style+.ambox,.mw-parser-output .ambox+link+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+style+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+link+.ambox{margin-top:-1px}html body.mediawiki .mw-parser-output .ambox.mbox-small-left{margin:4px 1em 4px 0;overflow:hidden;width:238px;border-collapse:collapse;font-size:88%;line-height:1.25em}.mw-parser-output .ambox-speedy{border-left:10px solid #b32424;background-color:#fee7e6}.mw-parser-output .ambox-delete{border-left:10px solid #b32424}.mw-parser-output .ambox-content{border-left:10px solid #f28500}.mw-parser-output .ambox-style{border-left:10px solid #fc3}.mw-parser-output .ambox-move{border-left:10px solid #9932cc}.mw-parser-output .ambox-protection{border-left:10px solid #a2a9b1}.mw-parser-output .ambox .mbox-text{border:none;padding:0.25em 0.5em;width:100%}.mw-parser-output .ambox .mbox-image{border:none;padding:2px 0 2px 0.5em;text-align:center}.mw-parser-output .ambox .mbox-imageright{border:none;padding:2px 0.5em 2px 0;text-align:center}.mw-parser-output .ambox .mbox-empty-cell{border:none;padding:0;width:1px}.mw-parser-output .ambox .mbox-image-div{width:52px}@media(min-width:720px){.mw-parser-output .ambox{margin:0 10%}}@media print{body.ns-0 .mw-parser-output .ambox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style>

<p>The <b>slide attack</b> is a form of <a href="Cryptanalysis" title="Cryptanalysis">cryptanalysis</a> designed to deal with the prevailing idea that even weak <a href="Cipher" title="Cipher">ciphers</a> can become very strong by increasing the number of <a href="Round_(cryptography)" title="Round (cryptography)">rounds</a>, which can ward off a <a href="Differential_attack" class="mw-redirect" title="Differential attack">differential attack</a>. The slide attack works in such a way as to make the number of rounds in a cipher irrelevant. Rather than looking at the data-randomizing aspects of the block cipher, the slide attack works by analyzing the <a href="Key_schedule" title="Key schedule">key schedule</a> and exploiting weaknesses in it to break the cipher. The most common one is the keys repeating in a cyclic manner.

</p><p>The attack was first described by <a href="David_A._Wagner" title="David A. Wagner">David Wagner</a> and <a href="Alex_Biryukov" title="Alex Biryukov">Alex Biryukov</a>. <a href="Bruce_Schneier" title="Bruce Schneier">Bruce Schneier</a> first suggested the term <i>slide attack</i> to them, and they used it in their 1999 paper describing the attack.

</p><p>The only requirements for a slide attack to work on a cipher is that it can be broken down into multiple rounds of an identical <i>F</i> function. This probably means that it has a cyclic key schedule. The <i>F</i> function must be vulnerable to a <a href="Known-plaintext_attack" title="Known-plaintext attack">known-plaintext attack</a>. The slide attack is closely related to the <a href="Related-key_attack" title="Related-key attack">related-key attack</a>.

</p><p>The idea of the slide attack has roots in a paper published by <a href="Edna_Grossman" title="Edna Grossman">Edna Grossman</a> and <a href="Bryant_Tuckerman" title="Bryant Tuckerman">Bryant Tuckerman</a> in an IBM Technical Report in 1977.<sup id="cite_ref-1" class="reference"><a href="#cite_note-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup> Grossman and Tuckerman demonstrated the attack on a weak <a href="Block_cipher" title="Block cipher">block cipher</a> named <a href="New_Data_Seal" title="New Data Seal">New Data Seal</a> (NDS). The attack relied on the fact that the cipher has identical subkeys in each round, so the cipher had a cyclic key schedule with a cycle of only one key, which makes it an early version of the slide attack. A summary of the report, including a description of the NDS block cipher and the attack, is given in <i>Cipher Systems</i> (Beker & Piper, 1982).

</p>

<div class="mw-heading mw-heading2"><h2 id="The_actual_attack">The actual attack</h2></div>

<p>First, to introduce some notation. In this section assume the cipher takes <i>n</i> bit blocks and has a key-schedule using <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle K_{1}\cdots K_{m}}">

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle K_{1}\cdots K_{m}}</annotation>

</semantics>

</math></span><img src="./8379ea832b11abcca14eac7d1b28ebf2fdacb934.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:10.173ex; height:2.509ex;" alt="{\displaystyle K_{1}\cdots K_{m}}" loading="lazy"></span> as keys of any length.

</p><p>The slide attack works by breaking the cipher up into identical permutation

functions, <i>F</i>. This <i>F</i> function may consist of more than one round

of the cipher; it is defined by the key-schedule. For example, if a cipher uses an alternating key schedule where it switches between a <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle K_{1}}">

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle K_{1}}</annotation>

</semantics>

</math></span><img src="./8520077dbcf03c2aabefd98d41a2269ed41a54fa.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:3.027ex; height:2.509ex;" alt="{\displaystyle K_{1}}" loading="lazy"></span> and <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle K_{2}}">

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle K_{2}}</annotation>

</semantics>

</math></span><img src="./57e1b324cf5b68f2729a8634ff76e396b634b75d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:3.027ex; height:2.509ex;" alt="{\displaystyle K_{2}}" loading="lazy"></span> for each round, the <i>F</i> function would consist of two rounds. Each of the <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle K_{i}}">

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle K_{i}}</annotation>

</semantics>

</math></span><img src="./719736a1feb0bd7e73bb1425641a61229f55bb6d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.773ex; height:2.509ex;" alt="{\displaystyle K_{i}}" loading="lazy"></span> will

appear at least once in <i>F</i>.

</p><p>

The next step is to collect <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 2^{n/2}}">

<msup>

</mrow>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle 2^{n/2}}</annotation>

</semantics>

the characteristics of the cipher fewer may suffice, but by the <a href="Birthday_problem" title="Birthday problem">birthday problem</a> no more than <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 2^{n/2}}">

<msup>

</mrow>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle 2^{n/2}}</annotation>

</semantics>

</math></span><img src="./fd18d146490780241da66ffee2950a5f13cf6469.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:4.025ex; height:2.843ex;" alt="{\displaystyle 2^{n/2}}" loading="lazy"></span> should be needed. These pairs, which denoted as <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle (P,C)}">

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle (P,C)}</annotation>

</semantics>

</math></span><img src="./e4c13790b5be29603e9649cfcb90a42ab0f2f554.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:6.355ex; height:2.843ex;" alt="{\displaystyle (P,C)}" loading="lazy"></span> are then used to find a <b>slid pair</b> which is denoted <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle (P_{0},C_{0})(P_{1},C_{1})}">

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle (P_{0},C_{0})(P_{1},C_{1})}</annotation>

</semantics>

</math></span><img src="./56f795c54e0501206c6490f49448dd0f85cad5d9.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:16.212ex; height:2.843ex;" alt="{\displaystyle (P_{0},C_{0})(P_{1},C_{1})}" loading="lazy"></span>. A slid pair has the property that <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle P_{0}=F(P_{1})}">

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle P_{0}=F(P_{1})}</annotation>

</semantics>

</math></span><img src="./91ba2ae3d720a41ddee988562d7da72cda409d22.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:11.742ex; height:2.843ex;" alt="{\displaystyle P_{0}=F(P_{1})}" loading="lazy"></span> and that <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle C_{0}=F(C_{1})}">

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle C_{0}=F(C_{1})}</annotation>

</semantics>

</math></span><img src="./1fe190d42764d09e69454db684fbc31d02415480.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:12.081ex; height:2.843ex;" alt="{\displaystyle C_{0}=F(C_{1})}" loading="lazy"></span>. Once a slid pair is identified, the cipher is broken because of the vulnerability to known-plaintext attacks. The key can easily be extracted from this pairing.

The slid pair can be thought to be what happens to a message after one application of the function <i>F</i>. It is ’slid’ over one encryption round and this is where the attack gets its

name.

</p><p><span class="mw-default-size" typeof="mw:File"></span>

</p><p>The process of finding a slid pair is somewhat different for each cipher

but follows the same basic scheme. One uses the fact that it is relatively

easy to extract the key from just one iteration of <i>F</i>. Choose any pair of

plaintext-ciphertext pairs, <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle (P_{0},C_{0})(P_{1},C_{1})}">

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle (P_{0},C_{0})(P_{1},C_{1})}</annotation>

</semantics>

</math></span><img src="./56f795c54e0501206c6490f49448dd0f85cad5d9.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:16.212ex; height:2.843ex;" alt="{\displaystyle (P_{0},C_{0})(P_{1},C_{1})}" loading="lazy"></span> and check to see what the keys corresponding to <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle P_{0}=F(P_{1})}">

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle P_{0}=F(P_{1})}</annotation>

</semantics>

</math></span><img src="./91ba2ae3d720a41ddee988562d7da72cda409d22.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:11.742ex; height:2.843ex;" alt="{\displaystyle P_{0}=F(P_{1})}" loading="lazy"></span> and <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle C_{0}=F(C_{1})}">

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle C_{0}=F(C_{1})}</annotation>

</semantics>

</math></span><img src="./1fe190d42764d09e69454db684fbc31d02415480.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:12.081ex; height:2.843ex;" alt="{\displaystyle C_{0}=F(C_{1})}" loading="lazy"></span> are. If these keys match, this is a slid pair; otherwise move on to the next pair.

</p><p>With <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 2^{n/2}}">

<msup>

</mrow>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle 2^{n/2}}</annotation>

</semantics>

</math></span><img src="./fd18d146490780241da66ffee2950a5f13cf6469.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:4.025ex; height:2.843ex;" alt="{\displaystyle 2^{n/2}}" loading="lazy"></span> plaintext-ciphertext pairs one slid pair is expected, along with a small number of false-positives depending on the structure of the cipher. The false positives

can be eliminated by using the keys on a different message-ciphertext pair to see if the encryption is correct. The probability that the wrong key will correctly encipher two or more messages is very low for a good cipher.

</p><p>Sometimes the structure of the cipher greatly reduces the number of

plaintext-ciphertext pairs needed, and thus also a large amount of the work.

The clearest of these examples is the <a href="Feistel_cipher" title="Feistel cipher">Feistel cipher</a> using a cyclic key schedule.

The reason for this is given a <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle P=(L_{0},R_{0})}">

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle P=(L_{0},R_{0})}</annotation>

</semantics>

</math></span><img src="./8aaa2fc338f42531c47a5ac47202d15600e0acdb.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:13.142ex; height:2.843ex;" alt="{\displaystyle P=(L_{0},R_{0})}" loading="lazy"></span> the search is for a <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle P_{0}=(R_{0},L_{0}\bigoplus F(R_{0},K))}">

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle P_{0}=(R_{0},L_{0}\bigoplus F(R_{0},K))}</annotation>

</semantics>

</math></span><img src="./34f1bb63e9b60845f24204bb086dcb8e67b5e7bd.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.338ex; width:27.697ex; height:3.843ex;" alt="{\displaystyle P_{0}=(R_{0},L_{0}\bigoplus F(R_{0},K))}" loading="lazy"></span>. This reduces the possible paired messages from <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 2^{n}}">

<msup>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle 2^{n}}</annotation>

</semantics>

</math></span><img src="./8226f30650ee4fe4e640c6d2798127e80e9c160d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:2.381ex; height:2.343ex;" alt="{\displaystyle 2^{n}}" loading="lazy"></span>

down to <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 2^{n/2}}">

<msup>

</mrow>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle 2^{n/2}}</annotation>

</semantics>

</math></span><img src="./fd18d146490780241da66ffee2950a5f13cf6469.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:4.025ex; height:2.843ex;" alt="{\displaystyle 2^{n/2}}" loading="lazy"></span> (since half the message is fixed) and so at most <span class="mwe-math-element mwe-math-element-inline"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 2^{n/4}}">

<msup>

</mrow>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle 2^{n/4}}</annotation>

</semantics>

</math></span><img src="./56d76554b155f6644a23312e653bdea1e71e36f5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:4.025ex; height:2.843ex;" alt="{\displaystyle 2^{n/4}}" loading="lazy"></span> plaintext-ciphertext pairs are needed in order to find a slid pair.

</p>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist">

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite id="CITEREFE._K._GrossmanB._Tuckerman1977" class="citation techreport cs1">E. K. Grossman; B. Tuckerman (1977). <i>Analysis of a Feistel-like cipher weakened by having no rotating key</i> (Technical report). IBM Thomas J. Watson Research Center. RC 6375.</cite></span>

</li>

</ol></div></div>

<ul><li><cite id="CITEREFHenry_BekerFred_Piper1982" class="citation book cs1">Henry Beker & Fred Piper (1982). <i>Cipher Systems: The Protection of Communications</i>. <a href="John_Wiley_%26_Sons" class="mw-redirect" title="John Wiley & Sons">John Wiley & Sons</a>. pp. <span class="nowrap">263–</span>267. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-0-471-89192-5</bdi>.</cite> (contains a summary of the paper by Grossman and Tuckerman)</li>

<li><cite id="CITEREFAlex_Biryukov_and_David_Wagner1999" class="citation conference cs1"><a href="Alex_Biryukov" title="Alex Biryukov">Alex Biryukov</a> and <a href="David_A._Wagner" title="David A. Wagner">David Wagner</a> (March 1999). <a rel="nofollow" class="external text" href="http://www.cs.berkeley.edu/~daw/papers/slide-fse99.ps"><i>Slide Attacks</i></a> <span class="cs1-format">(<a href="PDF" title="PDF">PDF</a>/<a href="PostScript" title="PostScript">PostScript</a>)</span>. 6th International Workshop on <a href="Fast_Software_Encryption" class="mw-redirect" title="Fast Software Encryption">Fast Software Encryption</a> (FSE '99). <a href="Rome" title="Rome">Rome</a>: <a href="Springer-Verlag" class="mw-redirect" title="Springer-Verlag">Springer-Verlag</a>. pp. <span class="nowrap">245–</span>259<span class="reference-accessdate">. Retrieved <span class="nowrap">2007-09-03</span></span>.</cite></li>

<li><cite id="CITEREFAlex_BiryukovDavid_Wagner2000" class="citation conference cs1">Alex Biryukov & David Wagner (May 2000). <a rel="nofollow" class="external text" href="https://www.iacr.org/archive/eurocrypt2000/1807/18070595-new.pdf"><i>Advanced Slide Attacks</i></a> <span class="cs1-format">(PDF/PostScript)</span>. Advances in Cryptology, Proceedings of <a href="EUROCRYPT" class="mw-redirect" title="EUROCRYPT">EUROCRYPT</a> 2000. <a href="Bruges" title="Bruges">Bruges</a>: Springer-Verlag. pp. <span class="nowrap">589–</span>606<span class="reference-accessdate">. Retrieved <span class="nowrap">2007-09-03</span></span>.</cite></li>

<li><cite id="CITEREFS._Furuya2001" class="citation conference cs1">S. Furuya (December 2001). <a rel="nofollow" class="external text" href="http://register.itfind.or.kr/Report01/200401/IITA/IITA-0763-017/IITA-0763-017.pdf"><i>Slide Attacks with a Known-Plaintext Cryptanalysis</i></a> <span class="cs1-format">(PDF)</span>. 4th International Conference on Information Security and Cryptology (ICISC 2001). <a href="Seoul" title="Seoul">Seoul</a>: Springer-Verlag. pp. <span class="nowrap">214–</span>225<span class="reference-accessdate">. Retrieved <span class="nowrap">2007-09-03</span></span>.</cite></li>

<li><cite id="CITEREFEli_Biham1994" class="citation journal cs1"><a href="Eli_Biham" title="Eli Biham">Eli Biham</a> (1994). <a rel="nofollow" class="external text" href="http://citeseer.ist.psu.edu/biham94new.html">"New Types of Cryptanalytic Attacks Using Related Keys"</a> <span class="cs1-format">(PDF/PostScript)</span>. <i><a href="Journal_of_Cryptology" title="Journal of Cryptology">Journal of Cryptology</a></i>. <b>7</b> (4): <span class="nowrap">229–</span>246. <a href="CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.8341">10.1.1.48.8341</a></span>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2Fbf00203965">10.1007/bf00203965</a>. <a href="ISSN_(identifier)" class="mw-redirect" title="ISSN (identifier)">ISSN</a> <a rel="nofollow" class="external text" href="https://search.worldcat.org/issn/0933-2790">0933-2790</a>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:19776908">19776908</a><span class="reference-accessdate">. Retrieved <span class="nowrap">2007-09-03</span></span>.</cite></li>

<li><cite id="CITEREFM._Ciet,_G._Piret,_J._Quisquater2002" class="citation journal cs1">M. Ciet, G. Piret, <a href="Jean-Jacques_Quisquater" title="Jean-Jacques Quisquater">J. Quisquater</a> (2002). <a rel="nofollow" class="external text" href="http://citeseer.ist.psu.edu/560898.html">"Related-Key and Slide Attacks: Analysis, Connections, and Improvements"</a> <span class="cs1-format">(PDF/PostScript)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">2007-09-04</span></span>.</cite> <span class="cs1-visible-error citation-comment"><code class="cs1-code">{{cite journal}}</code>: </span><span class="cs1-visible-error citation-comment">Cite journal requires <code class="cs1-code">|journal=</code> (help)</span><span class="cs1-maint citation-comment">CS1 maint: multiple names: authors list (link)</span></li></ul>

/* start https://en.wikipedia.org/ */

.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}

/* end https://en.wikipedia.org/ */

</style><style data-mw-deduplicate="TemplateStyles:r1236075235">

/* start https://en.wikipedia.org/ */

.mw-parser-output .navbox{box-sizing:border-box;border:1px solid #a2a9b1;width:100%;clear:both;font-size:88%;text-align:center;padding:1px;margin:1em auto 0}.mw-parser-output .navbox .navbox{margin-top:0}.mw-parser-output .navbox+.navbox,.mw-parser-output .navbox+.navbox-styles+.navbox{margin-top:-1px}.mw-parser-output .navbox-inner,.mw-parser-output .navbox-subgroup{width:100%}.mw-parser-output .navbox-group,.mw-parser-output .navbox-title,.mw-parser-output .navbox-abovebelow{padding:0.25em 1em;line-height:1.5em;text-align:center}.mw-parser-output .navbox-group{white-space:nowrap;text-align:right}.mw-parser-output .navbox,.mw-parser-output .navbox-subgroup{background-color:#fdfdfd}.mw-parser-output .navbox-list{line-height:1.5em;border-color:#fdfdfd}.mw-parser-output .navbox-list-with-group{text-align:left;border-left-width:2px;border-left-style:solid}.mw-parser-output tr+tr>.navbox-abovebelow,.mw-parser-output tr+tr>.navbox-group,.mw-parser-output tr+tr>.navbox-image,.mw-parser-output tr+tr>.navbox-list{border-top:2px solid #fdfdfd}.mw-parser-output .navbox-title{background-color:#ccf}.mw-parser-output .navbox-abovebelow,.mw-parser-output .navbox-group,.mw-parser-output .navbox-subgroup .navbox-title{background-color:#ddf}.mw-parser-output .navbox-subgroup .navbox-group,.mw-parser-output .navbox-subgroup .navbox-abovebelow{background-color:#e6e6ff}.mw-parser-output .navbox-even{background-color:#f7f7f7}.mw-parser-output .navbox-odd{background-color:transparent}.mw-parser-output .navbox .hlist td dl,.mw-parser-output .navbox .hlist td ol,.mw-parser-output .navbox .hlist td ul,.mw-parser-output .navbox td.hlist dl,.mw-parser-output .navbox td.hlist ol,.mw-parser-output .navbox td.hlist ul{padding:0.125em 0}.mw-parser-output .navbox .navbar{display:block;font-size:100%}.mw-parser-output .navbox-title .navbar{float:left;text-align:left;margin-right:0.5em}body.skin--responsive .mw-parser-output .navbox-image img{max-width:none!important}@media print{body.ns-0 .mw-parser-output .navbox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style><style data-mw-deduplicate="TemplateStyles:r1239400231">

/* start https://en.wikipedia.org/ */

.mw-parser-output .navbar{display:inline;font-size:88%;font-weight:normal}.mw-parser-output .navbar-collapse{float:left;text-align:left}.mw-parser-output .navbar-boxtext{word-spacing:0}.mw-parser-output .navbar ul{display:inline-block;white-space:nowrap;line-height:inherit}.mw-parser-output .navbar-brackets::before{margin-right:-0.125em;content:"[ "}.mw-parser-output .navbar-brackets::after{margin-left:-0.125em;content:" ]"}.mw-parser-output .navbar li{word-spacing:-0.125em}.mw-parser-output .navbar a>span,.mw-parser-output .navbar a>abbr{text-decoration:inherit}.mw-parser-output .navbar-mini abbr{font-variant:small-caps;border-bottom:none;text-decoration:none;cursor:inherit}.mw-parser-output .navbar-ct-full{font-size:114%;margin:0 7em}.mw-parser-output .navbar-ct-mini{font-size:114%;margin:0 4em}html.skin-theme-clientpref-night .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}@media(prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}}@media print{.mw-parser-output .navbar{display:none!important}}

/* end https://en.wikipedia.org/ */

</style></div><div role="navigation" class="navbox" aria-label="Navbox0" style="padding:3px"><table class="nowraplinks hlist navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><td colspan="2" class="navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"></div><table class="nowraplinks navbox-subgroup" style="border-spacing:0"><tbody><tr><td colspan="2" class="navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"></div><table class="nowraplinks navbox-subgroup" style="border-spacing:0"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><div id="Block_ciphers_(security_summary)197" style="font-size:114%;margin:0 4em"><a href="Block_cipher" title="Block cipher">Block ciphers</a> (<a href="Cipher_security_summary" title="Cipher security summary">security summary</a>)</div></th></tr><tr><th scope="row" class="navbox-group" style="width:1%">Common<br>algorithms</th><td class="navbox-list-with-group navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">

<li><a href="Blowfish_(cipher)" title="Blowfish (cipher)">Blowfish</a></li>

<li><a href="Data_Encryption_Standard" title="Data Encryption Standard">DES</a> (<a href="DES_supplementary_material" title="DES supplementary material">internal mechanics</a>, <a href="Triple_DES" title="Triple DES">Triple DES</a>)</li>

<li><a href="Serpent_(cipher)" title="Serpent (cipher)">Serpent</a></li>

<li><a href="Twofish" title="Twofish">Twofish</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Less common<br>algorithms</th><td class="navbox-list-with-group navbox-list navbox-even hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">

<li><a href="Camellia_(cipher)" title="Camellia (cipher)">Camellia</a></li>

<li><a href="Skipjack_(cipher)" title="Skipjack (cipher)">Skipjack</a></li>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Other<br>algorithms</th><td class="navbox-list-with-group navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">

<li><a href="Adiantum_(cipher)" title="Adiantum (cipher)">Adiantum</a></li>

<li><a href="Akelarre_(cipher)" title="Akelarre (cipher)">Akelarre</a></li>

<li><a href="Anubis_(cipher)" title="Anubis (cipher)">Anubis</a></li>

<li><a href="Ascon_(cipher)" title="Ascon (cipher)">Ascon</a></li>

<li><a href="BaseKing" title="BaseKing">BaseKing</a></li>

<li><a href="BassOmatic" title="BassOmatic">BassOmatic</a></li>

<li><a href="BATON" title="BATON">BATON</a></li>

<li><a href="Chiasmus_(cipher)" title="Chiasmus (cipher)">Chiasmus</a></li>

<li><a href="CIPHERUNICORN-A" title="CIPHERUNICORN-A">CIPHERUNICORN-A</a></li>

<li><a href="CIPHERUNICORN-E" title="CIPHERUNICORN-E">CIPHERUNICORN-E</a></li>

<li><a href="CLEFIA" title="CLEFIA">CLEFIA</a></li>

<li><a href="Cobra_ciphers" title="Cobra ciphers">Cobra</a></li>

<li><a href="COCONUT98" title="COCONUT98">COCONUT98</a></li>

<li><a href="Cryptomeria_cipher" title="Cryptomeria cipher">Cryptomeria/C2</a></li>

<li><a href="CRYPTON" title="CRYPTON">CRYPTON</a></li>

<li><a href="CS-Cipher" title="CS-Cipher">CS-Cipher</a></li>

<li><a href="Grand_Cru_(cipher)" title="Grand Cru (cipher)">Grand Cru</a></li>

<li><a href="Hasty_Pudding_cipher" title="Hasty Pudding cipher">Hasty Pudding cipher</a></li>

<li><a href="Hierocrypt" title="Hierocrypt">Hierocrypt</a></li>

<li><a href="Intel_Cascade_Cipher" title="Intel Cascade Cipher">Intel Cascade Cipher</a></li>

<li><a href="Iraqi_block_cipher" title="Iraqi block cipher">Iraqi</a></li>

<li><a href="Kalyna_(cipher)" title="Kalyna (cipher)">Kalyna</a></li>

<li><a href="KASUMI" title="KASUMI">KASUMI</a></li>

<li><a href="KeeLoq" title="KeeLoq">KeeLoq</a></li>

<li><a href="KHAZAD" title="KHAZAD">KHAZAD</a></li>

<li><a href="Khufu_and_Khafre" title="Khufu and Khafre">Khufu and Khafre</a></li>

<li><a href="KN-Cipher" title="KN-Cipher">KN-Cipher</a></li>

<li><a href="Kuznyechik" title="Kuznyechik">Kuznyechik</a></li>

<li><a href="Ladder-DES" title="Ladder-DES">Ladder-DES</a></li>

<li><a href="Lucifer_(cipher)" title="Lucifer (cipher)">Lucifer</a></li>

<li><a href="MacGuffin_(cipher)" title="MacGuffin (cipher)">MacGuffin</a></li>

<li><a href="Madryga" title="Madryga">Madryga</a></li>

<li><a href="MAGENTA" title="MAGENTA">MAGENTA</a></li>

<li><a href="Mercy_(cipher)" title="Mercy (cipher)">Mercy</a></li>

<li><a href="MISTY1" title="MISTY1">MISTY1</a></li>

<li><a href="MULTI2" title="MULTI2">MULTI2</a></li>

<li><a href="MultiSwap" title="MultiSwap">MultiSwap</a></li>

<li><a href="NewDES" title="NewDES">NewDES</a></li>

<li><a href="Nimbus_(cipher)" title="Nimbus (cipher)">Nimbus</a></li>

<li><a href="NOEKEON" title="NOEKEON">NOEKEON</a></li>

<li><a href="PRESENT" title="PRESENT">PRESENT</a></li>

<li><a href="Prince_(cipher)" title="Prince (cipher)">Prince</a></li>

<li><a href="QARMA" title="QARMA">QARMA</a></li>

<li><a href="REDOC" title="REDOC">REDOC</a></li>

<li><a href="Secure_and_Fast_Encryption_Routine" title="Secure and Fast Encryption Routine">SAFER</a></li>

<li><a href="SAVILLE" title="SAVILLE">SAVILLE</a></li>

<li><a href="SHACAL" title="SHACAL">SHACAL</a></li>

<li><a href="SHARK" title="SHARK">SHARK</a></li>

<li><a href="Simon_(cipher)" title="Simon (cipher)">Simon</a></li>

<li><a href="Speck_(cipher)" title="Speck (cipher)">Speck</a></li>

<li><a href="Spectr-H64" title="Spectr-H64">Spectr-H64</a></li>

<li><a href="Square_(cipher)" title="Square (cipher)">Square</a></li>

<li><a href="Threefish" title="Threefish">Threefish</a></li>

<li><a href="Treyfer" title="Treyfer">Treyfer</a></li>

<li><a href="XXTEA" title="XXTEA">XXTEA</a></li>

<li><a href="Zodiac_(cipher)" title="Zodiac (cipher)">Zodiac</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Design</th><td class="navbox-list-with-group navbox-list navbox-even hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Feistel_cipher" title="Feistel cipher">Feistel network</a></li>

<li><a href="Key_schedule" title="Key schedule">Key schedule</a></li>

<li><a href="Lai%E2%80%93Massey_scheme" title="Lai–Massey scheme">Lai–Massey scheme</a></li>

<li><a href="Product_cipher" title="Product cipher">Product cipher</a></li>

<li><a href="Confusion_and_diffusion" title="Confusion and diffusion">Confusion and diffusion</a></li>

<li><a href="Round_(cryptography)" title="Round (cryptography)">Round</a></li>

<li><a href="Avalanche_effect" title="Avalanche effect">Avalanche effect</a></li>

<li><a href="Block_size_(cryptography)" title="Block size (cryptography)">Block size</a></li>

<li><a href="Key_whitening" title="Key whitening">Key whitening</a> (<a href="Whitening_transformation" title="Whitening transformation">Whitening transformation</a>)</li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Attack<br>(<a href="Cryptanalysis" title="Cryptanalysis">cryptanalysis</a>)</th><td class="navbox-list-with-group navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Brute-force_attack" title="Brute-force attack">Brute-force</a> (<a href="EFF_DES_cracker" title="EFF DES cracker">EFF DES cracker</a>)</li>

<ul><li><a href="Biclique_attack" title="Biclique attack">Biclique attack</a></li>

<li><a href="3-subset_meet-in-the-middle_attack" title="3-subset meet-in-the-middle attack">3-subset MITM attack</a></li></ul></li>

<li><a href="Linear_cryptanalysis" title="Linear cryptanalysis">Linear</a> (<a href="Piling-up_lemma" title="Piling-up lemma">Piling-up lemma</a>)</li>

<li><a href="Differential_cryptanalysis" title="Differential cryptanalysis">Differential</a>

<ul><li><a href="Impossible_differential_cryptanalysis" title="Impossible differential cryptanalysis">Impossible</a></li>

<li><a href="Truncated_differential_cryptanalysis" title="Truncated differential cryptanalysis">Truncated</a></li>

<li><a href="Higher-order_differential_cryptanalysis" title="Higher-order differential cryptanalysis">Higher-order</a></li></ul></li>

<li><a href="Differential-linear_attack" title="Differential-linear attack">Differential-linear</a></li>

<li><a href="Distinguishing_attack" title="Distinguishing attack">Distinguishing</a> (<a href="Known-key_distinguishing_attack" title="Known-key distinguishing attack">Known-key</a>)</li>

<li><a href="Integral_cryptanalysis" title="Integral cryptanalysis">Integral/Square</a></li>

<li><a href="Boomerang_attack" title="Boomerang attack">Boomerang</a></li>

<li><a href="Related-key_attack" title="Related-key attack">Related-key</a></li>

<li><a href="Rotational_cryptanalysis" title="Rotational cryptanalysis">Rotational</a></li>

<li><a href="Side-channel_attack" title="Side-channel attack">Side-channel</a>

<ul><li><a href="Timing_attack" title="Timing attack">Timing</a></li>

<li><a href="Power_analysis" title="Power analysis">Power-monitoring</a></li>

<li><a href="Electromagnetic_attack" title="Electromagnetic attack">Electromagnetic</a></li>

<li><a href="Acoustic_cryptanalysis" title="Acoustic cryptanalysis">Acoustic</a></li>

<li><a href="Differential_fault_analysis" title="Differential fault analysis">Differential-fault</a></li></ul></li>

<li><a href="Interpolation_attack" title="Interpolation attack">Interpolation</a></li>

<li><a href="Partitioning_cryptanalysis" title="Partitioning cryptanalysis">Partitioning</a></li>

<li><a href="Rubber-hose_cryptanalysis" class="mw-redirect" title="Rubber-hose cryptanalysis">Rubber-hose</a></li>

<li><a href="Black-bag_cryptanalysis" title="Black-bag cryptanalysis">Black-bag</a></li>

<li><a href="Davies_attack" title="Davies attack">Davies</a></li>

<li><a href="Rebound_attack" title="Rebound attack">Rebound</a></li>

<li><a href="Chi-squared_test" title="Chi-squared test">Chi-square</a></li>

<li><a href="Time/memory/data_tradeoff_attack" title="Time/memory/data tradeoff attack">Time/memory/data tradeoff</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Standardization</th><td class="navbox-list-with-group navbox-list navbox-even hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Advanced_Encryption_Standard_process" title="Advanced Encryption Standard process">AES process</a></li>

<li><a href="CRYPTREC" title="CRYPTREC">CRYPTREC</a></li>

<li><a href="NESSIE" title="NESSIE">NESSIE</a></li>

<li><a href="NSA_Suite_B_Cryptography" title="NSA Suite B Cryptography">NSA Suite B</a></li>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Utilization</th><td class="navbox-list-with-group navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Initialization_vector" title="Initialization vector">Initialization vector</a></li>

<li><a href="Block_cipher_mode_of_operation" title="Block cipher mode of operation">Mode of operation</a></li>

<li><a href="Padding_(cryptography)" title="Padding (cryptography)">Padding</a></li></ul>

</div></td></tr></tbody></table><div></div></td></tr></tbody></table><div></div></td></tr><tr><td colspan="2" class="navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"></div><table class="nowraplinks mw-collapsible mw-collapsed navbox-subgroup" style="border-spacing:0"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><div id="Cryptography149" style="font-size:114%;margin:0 4em"><a href="Cryptography" title="Cryptography">Cryptography</a></div></th></tr><tr><th scope="row" class="navbox-group" style="width:1%">General</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="History_of_cryptography" title="History of cryptography">History of cryptography</a></li>

<li><a href="Outline_of_cryptography" title="Outline of cryptography">Outline of cryptography</a></li>

<li><a href="Classical_cipher" title="Classical cipher">Classical cipher</a></li>

<li><a href="Cryptographic_protocol" title="Cryptographic protocol">Cryptographic protocol</a>

<ul><li><a href="Authentication_protocol" title="Authentication protocol">Authentication protocol</a></li></ul></li>

<li><a href="Cryptographic_primitive" title="Cryptographic primitive">Cryptographic primitive</a></li>

<li><a href="Cryptanalysis" title="Cryptanalysis">Cryptanalysis</a></li>

<li><a href="Cryptocurrency" title="Cryptocurrency">Cryptocurrency</a></li>

<li><a href="Cryptosystem" title="Cryptosystem">Cryptosystem</a></li>

<li><a href="Cryptographic_nonce" title="Cryptographic nonce">Cryptographic nonce</a></li>

<li><a href="Cryptovirology" title="Cryptovirology">Cryptovirology</a></li>

<li><a href="Hash_function" title="Hash function">Hash function</a>

<ul><li><a href="Cryptographic_hash_function" title="Cryptographic hash function">Cryptographic hash function</a></li>

<li><a href="Key_derivation_function" title="Key derivation function">Key derivation function</a></li>

<li><a href="Secure_Hash_Algorithms" title="Secure Hash Algorithms">Secure Hash Algorithms</a></li></ul></li>

<li><a href="Digital_signature" title="Digital signature">Digital signature</a></li>

<li><a href="Kleptography" title="Kleptography">Kleptography</a></li>

<li><a href="Key_(cryptography)" title="Key (cryptography)">Key (cryptography)</a></li>

<li><a href="Key_exchange" title="Key exchange">Key exchange</a></li>

<li><a href="Key_generator" title="Key generator">Key generator</a></li>

<li><a href="Key_schedule" title="Key schedule">Key schedule</a></li>

<li><a href="Key_stretching" title="Key stretching">Key stretching</a></li>

<li><a href="Keygen" title="Keygen">Keygen</a></li>

<li>Machines</li>

<li><a href="Cryptojacking_malware" class="mw-redirect" title="Cryptojacking malware">Cryptojacking malware</a></li>

<li><a href="Ransomware" title="Ransomware">Ransomware</a></li>

<li><a href="Random_number_generation" title="Random number generation">Random number generation</a>

<ul><li><a href="Cryptographically_secure_pseudorandom_number_generator" title="Cryptographically secure pseudorandom number generator">Cryptographically secure pseudorandom number generator</a> (CSPRNG)</li></ul></li>

<li><a href="Pseudorandom_noise" title="Pseudorandom noise">Pseudorandom noise</a> (PRN)</li>

<li><a href="Secure_channel" title="Secure channel">Secure channel</a></li>

<li><a href="Insecure_channel" class="mw-redirect" title="Insecure channel">Insecure channel</a></li>

<li><a href="Subliminal_channel" title="Subliminal channel">Subliminal channel</a></li>

<li><a href="Encryption" title="Encryption">Encryption</a></li>

<li><a href="Decryption" class="mw-redirect" title="Decryption">Decryption</a></li>

<li><a href="End-to-end_encryption" title="End-to-end encryption">End-to-end encryption</a></li>

<li><a href="Harvest_now%2C_decrypt_later" title="Harvest now, decrypt later">Harvest now, decrypt later</a></li>

<li><a href="Information-theoretic_security" title="Information-theoretic security">Information-theoretic security</a></li>

<li><a href="Plaintext" title="Plaintext">Plaintext</a></li>

<li><a href="Codetext" class="mw-redirect" title="Codetext">Codetext</a></li>

<li><a href="Ciphertext" title="Ciphertext">Ciphertext</a></li>

<li><a href="Shared_secret" title="Shared secret">Shared secret</a></li>

<li><a href="Trapdoor_function" title="Trapdoor function">Trapdoor function</a></li>

<li><a href="Trusted_timestamping" title="Trusted timestamping">Trusted timestamping</a></li>

<li><a href="Key-based_routing" title="Key-based routing">Key-based routing</a></li>

<li><a href="Onion_routing" title="Onion routing">Onion routing</a></li>

<li><a href="Garlic_routing" title="Garlic routing">Garlic routing</a></li>

<li><a href="Kademlia" title="Kademlia">Kademlia</a></li>

<li><a href="Mix_network" title="Mix network">Mix network</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Mathematics</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Cryptographic_hash_function" title="Cryptographic hash function">Cryptographic hash function</a></li>

<li><a href="Block_cipher" title="Block cipher">Block cipher</a></li>

<li><a href="Stream_cipher" title="Stream cipher">Stream cipher</a></li>

<li><a href="Symmetric-key_algorithm" title="Symmetric-key algorithm">Symmetric-key algorithm</a></li>

<li><a href="Authenticated_encryption" title="Authenticated encryption">Authenticated encryption</a></li>

<li><a href="Public-key_cryptography" title="Public-key cryptography">Public-key cryptography</a></li>

<li><a href="Quantum_key_distribution" title="Quantum key distribution">Quantum key distribution</a></li>

<li><a href="Quantum_cryptography" title="Quantum cryptography">Quantum cryptography</a></li>

<li><a href="Post-quantum_cryptography" title="Post-quantum cryptography">Post-quantum cryptography</a></li>

<li><a href="Message_authentication_code" title="Message authentication code">Message authentication code</a></li>

<li><a href="Cryptographically_secure_pseudorandom_number_generator" title="Cryptographically secure pseudorandom number generator">Random numbers</a></li>

<li><a href="Steganography" title="Steganography">Steganography</a></li></ul>

</div></td></tr><tr><td class="navbox-abovebelow" colspan="2"><div>

<ul><li><span class="noviewer" typeof="mw:File"><span title="Category"></span></span> Category</li></ul>

</div></td></tr></tbody></table><div></div></td></tr></tbody></table></div></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2024-09-24" href="https://en.wikipedia.org/wiki/?title=Slide_attack&oldid=1247441649">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>